Content adaptive motion compensation filtering for high efficiency video coding

ABSTRACT

A system and method for adaptive motion filtering to improve subpel motion prediction efficiency of interframe motion compensated video coding is described. The technique uses a codebook approach that is efficient in search complexity to look-up best motion filter set from a pre-calculated codebook of motion filter coefficient set. In some embodiments, the search complexity is further reduced by partitioning the complete codebook into a small base codebook and a larger virtual codebook, such that the main calculations for search only need to be performed on the base codebook.

This disclosure relates to encoding and decoding of video signals, andmore particularly, to codebook-based encoding and decoding of adaptivefilters used for motion compensated prediction. This application is adivisional of U.S. application Ser. No. 12/974,940, filed on Dec. 21,2010 (pending), titled “CONTENT ADAPTIVE MOTION COMPENSATION FILTERINGFOR HIGH EFFICIENCY VIDEO CODING,” naming inventors Atul PURI, DanielSOCEK, and Chang-Kee CHOI, and having Attorney Docket number P49688. Theabove-cited application is incorporated herein by reference in itsentirety, for all purposes.

BACKGROUND Field

The advent of digital multimedia such as digital images, speech/audio,graphics, and video have significantly improved various applications aswell as opened up brand new applications due to relative ease by whichit has enabled reliable storage, communication, transmission, and,search and access of content. Overall, the applications of digitalmultimedia have been many, encompassing a wide spectrum includingentertainment, information, medicine, and security, and have benefitedthe society in numerous ways. Multimedia as captured by sensors such ascameras and microphones is often analog and the process of digitizationin the form of Pulse Coded Modulation (PCM) renders it digital. However,just after digitization, the amount of resulting data can be quitesignificant as is necessary for recreation of the analog representationneeded by speakers and/or TV display. Thus, efficient communication,storage or transmission of the large volume of digital multimediacontent requires its compression from raw PCM form to a compressedrepresentation, and thus many techniques for compression of multimediahave been invented. Over the years, video compression techniques havegrown very sophisticated to the point that they allow achieving highcompression factors between 10 and 100 while retaining high psychovisualquality, often similar to uncompressed digital video.

While tremendous progress has been made to date in the art and scienceof video compression (as exhibited by the plethora of standards bodiesdriven video coding standards such as MPEG-1, MPEG-2, H.263, MPEG-4part2, MPEG-4 AVC/H.264, MPEG-4 SVC and MVC, as well as industry drivenproprietary standards such as Windows Media Video, RealVideo, On2 VP,and the like), the ever increasing appetite of consumers for even higherquality, higher definition, and now 3D (stereo) video, available foraccess whenever, wherever, has necessitated delivery via various meanssuch as DVD/BD, over the air broadcast, cable/satellite, wired andmobile networks, to a range of client devices such as PCs/laptops, TVs,set top boxes, gaming consoles, portable media players/devices, andsmartphones, fueling the desire for even higher levels of videocompression. In the standards-body-driven standards, this is evidencedby the recently started effort by ISO MPEG in High Efficiency VideoCoding (HEVC), which is expected to combine new technology contributionsand technology from last couple of years of exploratory work on H.265video compression by ITU-T standards committee.

All aforementioned standards employ a general interframe predictivecoding framework that involves reducing temporal redundancy bycompensating for motion between frames (or fields) of video by firstdividing a frame into blocks and assigning motion vector/s to each blockof a frame to be coded, with respect to past decoded frame; these motionvectors are then transmitted to the decoder and used to generate amotion compensated prediction frame that is differenced with a pastdecoded frame and coded block by block, often by transform coding. Forhigher coding efficiency, it has been recognized that motion vector/sshould have a higher precision than integer pixel, so MPEG-1 and MPEG-2allow ½ pixel accuracy while more recent standards such as MPEG-4 part 2(version 2) video, and H.264 use ¼ pixel accuracy motion compensation.However since actual pixels of a frame are only available at integerpixel precision, special filters are needed to interpolate a block ofprevious frame to a subpel location as needed for generating motioncompensated prediction. The H.264 standard specifies a fixed filter setof separable filters that can be used for generating all 16 phasesneeded for ¼ pel interpolation. This fixed filter set is theoreticallyoptimum, as it is derived from Weiner theory for maximum gain; however,some filters in the fixed filter set are limited to 6 taps, while forothers as many as 9 taps are allowed. Furthermore, there is some loss inaccuracy in the integerization process due to precision limitation.While this type of prediction generally works on the average, this orany other single fixed filter, for specific pictures or scenes, can havea mismatch with characteristics of content, so there is room forimprovement.

Over last few years there has been substantial research in the area offiltering for ¼ pel motion compensation leading to development ofadaptive motion filtering. In adaptive filtering, coefficients are notfixed and thus are not known a priori; i.e., the coefficients arecomputed from the content itself and vary with time. The mathematicalprocedure used to compute filter coefficients is based on wiener hopfequation.

While the weiner hopf mathematical procedure can calculate an optimumfilter coefficient set, there are significant issues in practicalintegration of this approach in a video coding system. Thus in thecontext of H.265 and/or HEVC development, a number of proposals havebeen made to address the various shortcomings as well as to increaseadaptivity for improved coding gain. These proposals can be brieflylisted as follows.

Choice between nonseparable vs. separable filters—The computation ofnonseparable filters can be more compute intensive, but theoreticallynonseparable filters can result in higher quality. However, nonseparablefilters also require roughly twice the number of coefficients ofseparable filters so the coding overhead of nonseparable filters can behigh. Overall, for motion filtering, separable filters can providereasonable coding gain and thus offer an overall better tradeoff.

The tradeoff of number of iterations vs. gain for each iteration—Theiterative solution to weiner hopf equation takes a number of iterationsto converge to give good results. The number of iterations neededdepends on how far the default filter set (used initially for firstiteration) is from the optimum results. If they are close, often up to 4iterations may be enough, but if they are very different, 16 to 20iterations may be needed. If the difference between default filter andthe optimal filter is a lot, stopping at 4 iterations will not result inmost of the gains.

Accuracy of various coefficients for best tradeoff of bit cost vs.quality—By keeping certain coefficients in a filter set to loweraccuracy, some bit savings can result. In fact the maximum precision ofa filter coefficient often can be limited to 8 bits, and in someexceptional cases, the precision used may be limited to 10 bits.

Coefficient bit cost reduction for transmission to decoder (actualvalues, differential, limits on updates)—The number of coefficients tobe sent to decoder must be limited, as for instance, typicallynonseparable filter set may require sending as many as 120 coefficients(with bit cost of 650-950 bits per frame) while even a separable filterset may require sending 45-60 coefficients (with bit cost of 400-550bits per frame). With differential coding (encode filter set of currentframe differentially with previous frame's filter set, or even withrespect default filter set) or by placing limits on updates, this bitcount can be reduced somewhat, albeit with some loss in quality.

Multiple filter sets within a picture to improve overall gains—Whileeven one wiener filter set computed every frame, can give gains over,say, the H.264 standard filter set, by having a choice of multiplefilter sets within a frame (such as on block or slice basis) can resultin higher gains. One problem however that the bit cost of even 2 filtersets per frame may be excessive as compared to the additional gains.Thus managing bit cost of filter coefficient is necessary when usingmultiple filter sets.

Rate Distortion Optimization (“RDO”) complexity as it may otherwiseinvolve multiple iterations on filter switching map to derive the bestresults—When using multiple filters, to get high gain, often it isnecessary to use rate distortion optimization in an iterative manner toget the right block size for filter selection that yields a goodtradeoff between frequency of filter switching versus the gains.

Block map overhead bit cost when using multiple filters—When usingmultiple filters (including the case of switching between a standardfilter and a computed filter), the switching map cost can besubstantial. For instance, if one were to switch between two filters ona macroblock basis using 1 bit for macroblock, then for a CommonIntermediate Format (“CIF”) sequence, 396 bits of extra overhead wouldbe added, in addition to bits cost to possibly send two filter-sets.

Additional gains by using integer position filters, and filters withoffsets—Some attempts have been made to squeeze gains by computing afilter for integer position in case when the best ¼ pel position is theinteger position. Further, some experiments have been conducted usingfilters with offsets for higher gains. Both these cases requireadditional bits of overhead.

As noted earlier, while many techniques and variations have beensuggested, the coefficient bit count overhead of current approaches,even after differential coding, is too high. Additionally, the existingtechniques are computationally complex due to the need for calculatingon the fly multiple iterations of coefficient sets. Moreover, the onlyway for current system to be very adaptive is by extensive use of RDOfor multiple switched filters which means extra overhead and complexity.

Additional information related to adaptive motion-compensation filteringmay be found in the following references, each of which is incorporatedfully by reference, for all purposes:

-   T. Wedi, “Adaptive Interpolation Filter For Motion Compensated    Prediction,” Proc. Int. Conf on Image Processing (ICIP) 2002, pp.    509-511, 2002.-   V. Vatis et al, “Coding of Coefficients of two-dimensional    non-separable Adapive Wiener Interpolation Filter,” Proc. SPIE    Visual Communications and Image Processing (VCIP) 2005, July 2005-   V. Vatis and Joern Ostermann, “Locally Adaptive Non-Separable    Interpolaion Filter for H.264/AVC,” Proc. Int. Conf on Image    Processing (ICIP) 2006, October 2006.-   S. Wittmann and T. Wedi, “Separable Adaptive Interpolation Filter    for Video Coding”, Proc. Int. Conf on Image Processing (ICIP) 2008,    pp. 2500-2503, 2008.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a general block diagram of a prior art interframe encoderemploying motion compensated prediction that uses fixed motionfiltering.

FIG. 2 shows a prior art decoder, corresponding to prior art encoder,and works similarly to the local decoding loop at the encoder.

FIG. 3 shows a portion of a video frame organized as a pixel-grid thatis further divided into subpel grid, at which a motion compensatedprediction block is calculated.

FIGS. 4 a-o show a mapping of 6/9-taps into a 6×6 filter matrix for eachsubpel position.

FIG. 5 shows a block diagram of a prior art interframe encoder employingmotion compensated predictor that uses generalized adaptive motionfiltering.

FIG. 6 shows block diagram of a prior art interframe decoder employingmotion compensated predictor that uses generalized adaptive motionfiltering.

FIGS. 7 a-f show various partitioning modes for dividing a picture.

FIG. 8 shows a block diagram of an interframe encoder employing motioncompensated predictor that uses motion filtering codebook encoder inaccordance with one embodiment.

FIG. 9 shows a block diagram of an interframe decoder employing motioncompensated predictor that uses motion filtering codebook decoder inaccordance with one embodiment.

FIG. 10 shows an ‘offline’ routine for generating a motion filtercodebook or codebooks for subpel and integer pel locations.

FIG. 11 shows an ‘online’ routine for searching a codebook for a motionfilter set in accordance with one embodiment.

FIG. 12 illustrates an exemplary bitstream syntax, in accordance withvarious motion-compensation codebook filter encoders and decoders andvariously described herein.

FIGS. 13 a-b illustrate a sequence of pictures or frames within a videostream, in accordance with various embodiments.

FIG. 14 illustrates an exemplary video encoding/decoding systemaccording to one embodiment.

FIG. 15 illustrates several components of an exemplary encoding device,in accordance with one embodiment.

FIG. 16 illustrates several components of an exemplary decoding device,in accordance with one embodiment.

FIG. 17 illustrates a codebook motion-compensation filtering videoencoding routine, such as may be performed by encoding device inaccordance with one embodiment.

FIG. 18 illustrates a subroutine for obtaining a codebook, in accordancewith one embodiment.

FIG. 19 illustrates a subroutine for selecting a subset ofmotion-compensation filters from the codebook, in accordance with oneembodiment.

FIG. 20 illustrates a subroutine for determining an integer-positionmotion-compensation filter for a portion of a picture, in accordancewith one embodiment.

FIG. 21 illustrates a codebook motion-compensation filtering videodecoding routine, such as may be performed by decoding device inaccordance with one embodiment.

DETAILED DESCRIPTION

The detailed description that follows is represented largely in terms ofprocesses and symbolic representations of operations by conventionalcomputer components, including a processor, memory storage devices forthe processor, connected display devices and input devices. Furthermore,these processes and operations may utilize conventional computercomponents in a heterogeneous distributed computing environment,including remote file Servers, computer Servers and memory storagedevices. Each of these conventional distributed computing components isaccessible by the processor via a communication network.

The phrases “in one embodiment,” “in various embodiments,” “in someembodiments,” and the like are used repeatedly. Such phrases do notnecessarily refer to the same embodiment. The terms “comprising,”“having,” and “including” are synonymous, unless the context dictatesotherwise.

Various embodiments of systems and methods for motion filtering forinterframe video coding are described. Some of these embodiments mayoffer reduced computational complexity when compared with existingsolutions, as instead of taking many iterations to iteratively calculatefilter coefficients during encoding, a motion filter set is looked upfrom a pre-calculated codebook of motion filter coefficient sets.

In some embodiments, the search complexity may be further reduced bypartitioning the complete codebook into a small “base” codebook and alarger “virtual” codebook, such that the main calculations for searchonly need to be performed on the base codebook. Such embodiments mayreduce storage by (a) storing only the base codebook, and an algorithmto synthesize remaining codebook; (b) storing for each filter set, afilter with an appropriate number of taps according to the motion subpelfiltering location; and, (c) storing only the needed bit-precision percoefficient.

In various embodiments, the described motion filter codebook techniquesmay be employed on pictures, slice groups, block maps, merged blockmaps, or adaptive partitions such as bi-tree, quad-tree, or contentdependent regions, or the like. The ability of this technique to workwith content dependent partitions also reduces complexity and improvesaccuracy as compared to other techniques that are driven solely by RateDistortion Optimization (“RDO”). Various embodiments may be used forsubpel filtering only, integer-position filtering only, or both.Further, the codebook can be easily replaced or extended to adapt it tothe nature of the content.

Details of filter codebook design and efficient search of codebook aredescribed. With the described method of codebook design and forsuggested codebook size, the technique may result in good motionfiltering performance, potentially increasing prediction efficiency fora broad spectrum of video content.

In various embodiments, the techniques described may be efficient inbits, as only an index into the codebook may be needed to identify aselected subpel filter set or integer pel filter. In many cases, codingan index may be more efficient than coding actual coefficients orsending differentially encoded filter coefficients. While the number ofactual indices sent depends on the number of partitions, compared toexisting approaches using same type of partitioning, the describedcodebook-based techniques may be more efficient in bit-rate.

Various embodiments can be used with typical video coding that usetraditional picture structures composed of I-, P-, B-picture coding.Other embodiments may be used with other structures instead or inaddition to I- and P-pictures, such as hierarchical B-pictures,unidirectional B-pictures, or other B-picture alternatives.

Reference is now made in detail to the description of the embodiments asillustrated in the drawings. While embodiments are described inconnection with the drawings and related descriptions, there is nointent to limit the scope to the embodiments disclosed herein. On thecontrary, the intent is to cover all alternatives, modifications andequivalents. In alternate embodiments, additional devices, orcombinations of illustrated devices, may be added to, or combined,without limiting the scope to the embodiments disclosed herein.

FIG. 1 shows a general block diagram of a prior art interframe encoder100 employing motion compensated prediction that uses fixed motionfiltering. One or more video frames (vidfrms) is divided into blocks(blks) by blocks indexer 101. Blocks (blks) are input one a time todifferencer 133 and differenced with corresponding prediction signalblocks (pred), and the residual (res) is forward transformed bytransformer 135, resulting in a block of coefficients (tcof) that isthen sent to the quantizer 138, resulting in a block of quantizedcoefficients (tcofq) that are sent both to the entropy coder 118 and theinverse quantizer 140. Inverse quantizer 140 sends de-quantized block ofcoefficients (tcof) to the inverse transformer 143. At adder 145, theprediction block (pred) from the motion compensation loop is added tothe de-quantized residual block (res′) at the output of inversetransformer 143. At adder 145, the prediction block (pred) from themotion compensation loop is added to the de-quantized residual block(res′) at the output of inverse transformer 743. Adder 745 outputs thelocally decoded block (rec), which is then sent to the frame assemblerand deblock filter processor 148, which reduces the blockiness. Theblocks (recd) at the output of frame assembler and deblock filteringprocessor 148 form a frame that is used as the reference frame formotion estimator 128 and motion compensated predictor 130.

The motion estimator 128 computes motion vectors (mv) between blocks(blks) of original frame with respect to the reconstructed frame (recd).The process of motion vector computation includes computing an integerpel vector per block, followed by a subpel vector (sv) (to, e.g., ¼ pelresolution) which is computed using subpel interpolator 129. Normallythe subpel interpolator 129 is contained within motion estimator 128itself, but for clarity of illustration it is shown and referred toseparately. The motion estimator 128 searches for best match and hencethe best motion vector (mv), where as motion compensated predictor 130uses the motion vector (mv) to generate motion compensated predictionblock (pred). The motion compensator 130 also uses a subpel (e.g., to ¼pel resolution) interpolator 131 like subpel interpolator 129. Thefilter set (fmf) used by both subpel interpolators 129 and 131 ispre-specified and thus fixed. The entropy coder 118 encodes thequantized transform coefficients (not shown), differential motionvectors (dmv), and overhead data (not shown), generating a compressedbitstream 128.

FIG. 2 shows a prior art decoder 200, corresponding to prior art encoder100, and works similarly to the local decoding loop 155 at the encoder100. Specifically, the compressed bitstream 201 to be decoded is inputto the entropy decoder 203 which decodes blocks of quantizedcoefficients (tcofq), differential motion vectors (dmv) and overheaddata (not shown). The quantized coefficient blocks (tcofq) are theninverse quantized by inverse quantizer 203, resulting in de-quantizedcoefficients (tcof′), which are then inverse transformed by inversetransformer 215, resulting in decoded residual blocks (res′). At adder223, de-quantized coefficients (tcof′) are added to motion compensatedprediction blocks (pred) obtained by using corresponding motion vectors(mv) at motion compensated predictor 230, using subpel vector (sv) (to,e.g., ¼ pel resolution), which is computed using subpel interpolator229. The resulting decoded video (rec) is deblocked in frame assemblerand deblocking filter 225, and just as at the encoder 100, the deblockedvideo (recd) is used as a reference frame. The motion compensatedpredictor 230 at the decoder 200 works similarly to the motioncompensated predictor 130 at the encoder 100, such as motion compensatedpredictor 230 uses a similar subpel interpolator 229 with the same fixedmotion filter (fmf) as that used by the encoder 100.

FIG. 3 shows a portion 300 of a video frame organized as a pixel-gridthat is further divided into subpel grid, at which a motion compensatedprediction block is calculated. The integer pixel locations are shown asA1-A6, B1-B6, C1-C6, D1-D6, E1-E6, and F1-F6. The ¼ pel locationsbetween C3-C4, and D3-D4 are shown by positions {a, b, c, d, e, f g, h,i, j, k, l, m, n, o} such that each block can be compensated at one ofthese quarter pel positions. FIG. 3 also shows several ½ pel locationsat positions aa, bb, cc, dd, ee, ff, gg, hh, ii, and jj.

Calculation of filter-sets for subpel positions {a, b, c, d, e, f g, h,i, j, k, l, m, n, o} is performed using either 6-tap or 9-tap filters.The filter coefficients are mapped to a 6×6 matrix which is used tocompute the subpel value from the 6×6 neighborhood of surrounding pels(A1-F6).

FIGS. 4 a-o show a mapping of 6/9-taps into a 6×6 filter matrix for eachsubpel position.

FIG. 4 a shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{a}; this position requires 6 filter coefficients.

FIG. 4 b shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{b}; this position corresponds to horizontal half pel position andrequires only 3 filter coefficients due to symmetry.

FIG. 4 c shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{c}; this position requires 6 filter coefficients.

FIG. 4 d shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{d}; this position requires 6 filter coefficients.

FIG. 4 e shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{e}; this position requires 6 filter coefficients.

FIG. 4 f shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{f}; this position requires 9 filter coefficients.

FIG. 4 g shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{g}; this position requires 6 filter coefficients.

FIG. 4 h shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{h}; this position corresponds to vertical half pel position and due tosymmetry only requires 3 coefficients.

FIG. 4 i shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{i}; this position requires 9 filter coefficients.

FIG. 4 j shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{j}; this position requires 9 filter coefficients.

FIG. 4 k shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{k}; this position requires 9 filter coefficients.

FIG. 4 l shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{l}; this position requires 6 filter coefficients.

FIG. 4 m shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{m}; this position requires 6 filter coefficients.

FIG. 4 n shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{n}; this position requires 9 filter coefficients.

FIG. 4 o shows filter coefficients and pixels on which they are appliedto directly compute the filtered interpolation block at subpel position{o}; this position requires 6 filter coefficients.

Adaptive Wiener Filtering

Before discussing details of FIG. 5, the theory of optimal filtering isbriefly discussed, as that is the basis of adaptive filter design usingthe wiener filtering method.

For each of the subpel locations, cross-correlation and autocorrelationmatrices are accumulated, from which the optimal wiener filter set canbe computed by solving the Weiner Hopf equation as follows.

Let x(n) be the input signal, y(n) be the output, and h(n) representfilter coefficients.

Filter output:

${y(n)} = {\sum\limits_{k = 0}^{N - 1}\; {{h(k)}{x\left( {n - k} \right)}}}$

Error signal: e(n)=d(n)−y(n)

Mean Square Error: J=E[e²(n)]

${x(n)} = {\begin{bmatrix}{x(n)} \\{x\left( {n - 1} \right)} \\\vdots \\{x\left( {n - N + 1} \right)}\end{bmatrix}\mspace{14mu} {and}}$ $h = \begin{bmatrix}{h(0)} \\{h(1)} \\\vdots \\{h\left( {N - 1} \right)}\end{bmatrix}$ y(n) = h^(T)x(n) = x(n)^(T)h $\begin{matrix}{{E\left\lbrack {e^{2}(n)} \right\rbrack} = {E\left\lbrack \left( {{d(n)} - {y(n)}} \right)^{2} \right\rbrack}} \\{= {{E\left\lbrack {d^{2}(n)} \right\rbrack} - {2{E\left\lbrack {{d(n)}{x(n)}^{T}} \right\rbrack}h} + {h^{T}{E\left\lbrack {{x(n)}{x(n)}^{T}} \right\rbrack}h}}} \\{= {P_{d} - {2R_{dx}^{T}h} + {h^{T}R_{xx}h}}}\end{matrix}$

In vector form:

Where, P_(d) is a scalar.

Crosscorrelation row vector: R_(dx)=E[d(n)x(n)^(T)]

Autocorrelation matrix: R_(xx)=[x(n)x(n)^(T)]

To find minimum, the derivative is taken and set it to zero as follows:

$\frac{\partial{E\left\lbrack {e^{2}(n)} \right\rbrack}}{\partial{h(k)}} = {{{{- 2}R_{dx}^{T}} + {2\; R_{xx}h}} = 0}$

Now solving for h, the Wiener Hopf equation is as follows:

h=R _(xx) ⁻¹ R _(dx)

The Wiener Hopf equation determines optimum filter coefficients in meansquare error, and the resulting filter is called the ‘wiener’ filter.

In the above equation, h is the vector of filter coefficients (typically6 or 9 coefficients), R_(xx) is the autocorrelation matrix (for blockdata of reference frame) and R_(dx) is a cross-correlation matrix/rowvector (between the source frame and reference frame block data). Thematrices are accumulated for each subpel position separately, and henceh can be computed by solving the aforementioned equation for each subpelposition, thus obtaining the adapted filter set of 16 filters (for ¼pellocations).

FIG. 5 shows a block diagram of a prior art interframe encoder 500employing motion compensated predictor that uses generalized adaptivemotion filtering. The blocks indexer 501, forward transform 535,quantizer 538, inverse quantizer 540, inverse transform 543, frameassembler and deblock filtering processor 548, and entropy coder 518work the same way as the corresponding components of encoder 100, asshown in FIG. 1 and discussed above, and their descriptions need not bereiterated here. Similarly, the motion estimator 528 and motioncompensator 530 works the same way as motion estimator 128 and motioncompensator 130, discussed above, except for filter sets they use. Here,the focus is motion filtering, and only this subsystem is discussed indetail.

Unlike H.264, which uses a fixed filter set, encoder 500 computes afilter set from the data. This computation takes place in subpel(wiener) iterative filter set computer 558, using the wiener hopfequations discussed earlier. The process starts with use of a defaultfilter set to compute lowest Sum of Absolute Differences (“SAD”)position for each block, which reflects the best match subpel matchposition. In the next iteration, using these subpel positions, a newfilter set is computed, which when used provides updated subpellocations. The process is iterative and thus several iterations (4-20)may be needed for the process to converge. The process iscompute-intensive due to the complexity of evaluation at each iteration.In some cases, it is possible to limit the number of iterations, tradingoff complexity for performance. The computed adaptive motion filter set(amf) is provided to subpel interpolator 531 at motion compensatedpredictor 530. This filter set (amf) also needs to be encoded and sentvia the bitstream to the decoder. Since the filter set (amf) can use asmany as 99 filter coefficients, efficient encoding of filter set isimportant. Typical techniques range from sending filter set for mostsignificant positions, differential coding of coefficients (dmf)(generated by differencer 560), suppression of coefficients that did notchange much since last time they were sent, and the like. Assuming thatfilter coefficients can be coded efficiently, multiple filter sets maybe sent per picture with the goal of choosing between two or more filtersets for higher efficiency; this operation is performed in spatialpartitioner and partitions encoder 505, which generates a partition map(ptmap). Rate distortion optimizer 508 is often used to ensure that evenwhen using multiple filters and associated overhead, gain will stillresult.

FIG. 6 shows block diagram of a prior art interframe decoder 600employing motion compensated predictor that uses generalized adaptivemotion filtering. The entropy decoder 603, inverse transform 615,inverse quantizer 613, and frame assembler and deblock filteringprocessor 625 work the same way as the corresponding components ofdecoder 200, as shown in FIG. 2 and discussed above, and theirdescriptions need not be reiterated here. Similarly, the motioncompensated predictor 630 works the same way as motion compensatedpredictor 230, discussed above, except for filter sets used. Here, thefocus is motion filtering, and only this subsystem is discussed indetail.

The entropy decoder 603 decodes a codeword (dmf) decoding thedifferential value of the motion filter to which a filter setrepresenting prediction is added at adder 631, resulting in acoefficient filter set (amf). This filter set (amf) is provided tosubpel interpolator 629 in motion compensated predictor 630. Further, incase multiple filters are used, a partition map (ptmap) may be decodedso that the filter (amf) can be applied to the correct portion of thepicture.

FIGS. 7 a-f show various partitioning modes for dividing a picture. Forinstance, FIG. 7 a represents picture based partitioning where filtercodes are only switched on a picture-by-picture basis. FIG. 7 b showsslice or slice-group based partitioning such that a first filter set isapplied on slice group ‘A’, and a second filter set is applied on slicegroup ‘B’. FIG. 7 c represents a block map that identifies which filterto use for block type ‘A’ and which filter to use for block type ‘B’.FIG. 7 d shows division of a picture into tiles and further division oftiles into bi-tree partitions such that various cuts of bi-tree based onrate-distortion optimization (“RDO”) are labeled as ‘A’ or ‘B’,indicating that they may correspondingly use a first or a second filterset. Likewise, FIG. 7 e shows partitioning of a picture into tiles, andfurther partitioning of a tile into two types of quad-tree partitionslabeled as ‘A or ‘B’ such that they may correspondingly use a first or asecond filter set. Finally, FIG. 7 f shows regions that result frommerging of slices, or merging of blocks, or merging of bi-tree, ormerging of quad-tree partitions, or purely by spatial segmentation.

FIG. 8 shows a block diagram of an interframe encoder 800 employingmotion compensated predictor that uses motion filtering codebook encoderin accordance with one embodiment. The blocks indexer 801, forwardtransform 835, quantizer 838, inverse quantizer 840, inverse transform843, frame assembler and deblock filtering processor 848, and entropycoder 818 work the same way as the corresponding components of encoder100, as shown in FIG. 1 and discussed above, and their descriptions neednot be reiterated here. Similarly, the motion estimator 828 and motioncompensator 830 work the same way as motion estimator 128 and motioncompensator 130 discussed above, except for filter sets they use. Here,the focus is motion filtering, and only this subsystem is discussed indetail.

Compared to existing adaptive motion filtering encoders, thecodebook-based motion filtering encoder 800 selects a filter set from anexisting codebook instead of computing the motion filter explicitly. Inone embodiment, two types of codebooks are used, one that stores subpelfilter sets 860 and one that stores integer-position filters 863. MCFilter set Codebook Search Processor 858 allows efficient search of therespective codebooks yielding subpel and integer-position codebookindices, (mcfsi) and (mcfsi), that correspondingly refer to subpelfilter set (mcfs) and integer-position filter (mcfi).

In various embodiments, the subpel filter set (mcfs) andinteger-position filter (mcfi) can be sent on a picture (once only) oron a spatial partition (multiple times per picture) basis. In variousembodiments, any type of spatial partitions can be used, such as slice,variable block size, block, bi-tree, quad-tree, region, tile, and thelike (see, e.g., FIGS. 7 a-f). This partitioning is performed by spatialpartitioner and partitions encoder 805. The specifics of partitioningsuch as number of partitions to be sent are decided based on ratedistortion analysis by bitrate/distortion tradeoff analyzer 808, as wellas scene content analyzer 803. The best match subpel filter set andinteger pel filter set are sent in the bitstream to decoder. The subpelfilter set (mcfs) and integer-position filter (mcfi) are provided to MCFiltering Processor 865 to generate motion compensated prediction atmotion estimator/motion compensated predictor 828. In some embodiments,the process may be efficient in search, as well as in bit cost forrepresenting of filters/filter sets by indices.

FIG. 9 shows a block diagram of an interframe decoder 900 employingmotion compensated predictor that uses motion filtering codebook decoderin accordance with one embodiment. The entropy decoder 903, inversetransform 915, inverse quantizer 913, and frame assembler and deblockfiltering processor 925 work the same way as the correspondingcomponents of decoder 200, as shown in FIG. 2 and discussed above, andtheir descriptions need not be reiterated here. Similarly, the motioncompensated predictor 930 works the same way as motion compensatedpredictor 230, discussed above, except for filter sets used. Here, thefocus is motion filtering, and only this subsystem is discussed indetail.

The entropy decoder 903 entropy decodes bitstream 901 to obtain codebooksubpel motion filter index (mcfsi) and/or integer-position motion filterindex (mcfii). These indices (mcfsi) and (mcfii) are used to access thedesired subpel filter set (mcfs) and/or integer-position filter (mcfi)from subpel codebook 933 and/or integer-position codebook 935. Theresulting subpel filter set mcfs and/or intpel filter mcfi are providedto MC Filtering Processor 929 that performs the subpel interpolationand/or integer pel filtering to generate motion compensated prediction(pred). In some embodiments, flags (filt_sent) and (intfilt_sent) mayfurther be decoded by entropy decoder 903, indicating whether thebitstream 901 includes subpel motion filter index (mcfsi) andinteger-position motion filter index (mcfii), respectively.

Table 1 shows two sample filter sets (id=0 and id=1) from an exemplarysubpel “base” codebook. In one embodiment, the subpel “base” codebookmay include 16 “base” subpel filter sets (each including 15 or 16subpel-position filters in the case of ¼ pel filtering). Individualsubpel-position filters from the 16 “base” subpel filter sets may beused in different pre-determined combinations to create a “virtual”codebook. In one embodiment, the “virtual” codebook may include 256subpel filter sets. In other embodiments, the “base” and “virtual”codebooks may include more or fewer filter sets.

TABLE 1 Subpel (¼ pel) a-o Positions Base Codebook subset Filter Set id= 0 a₀ 8 −31 217 83 −33 12 b₀ 14 −39 153 153 −39 14 c₀ 15 −30 68 216 −152 d₀ −12 20 187 83 −25 3 e₀ 10 −41 202 112 −34 7 f₀ 23 −123 89 −278 1004−60 421 1 −53 g₀ 15 −56 186 128 −24 7 h₀ −1 −19 148 148 −19 −1 i₀ −13 21−73 −8 6 −141 890 469 −127 j₀ 19 −20 16 −55 48 −130 103 −214 745 k₀ 41 3−169 −61 −1 −115 954 466 −94 l₀ −2 −6 77 210 −24 1 m₀ 6 −39 202 103 −259 n₀ −11 −74 118 −369 1071 66 332 −15 −94 o₀ 19 −53 162 169 −56 15Filter Set id = 1 a₁ 39 25 59 72 26 35 b₁ 38 27 63 63 27 38 c₁ −58 −3 27112 57 121 d₁ −121 82 294 91 −61 −29 e₁ −23 69 42 147 −2 23 f₁ −71 73131 226 470 212 300 −172 −145 g₁ 18 203 237 −46 246 −402 h₁ −430 338 220220 338 −430 i₁ −525 −42 196 101 −92 218 244 461 463 j₁ −884 −102 −53378 105 240 270 138 420 k₁ 128 4230 −1742 1603 −3906 766 −1538 1578 −93l₁ −232 176 76 109 233 −106 m₁ 37 47 85 121 72 −106 n₁ 14 99 300 166 355211 331 −206 −246 o₁ 49 16 55 61 8 67 Filter Set id = 2 a₃ . . . . . . .. . . . . . . . . . . . . . . . . . . . . . .

Of the exemplary filter sets show in Table 1, filter set id=0corresponds to a sharp scene, and filter set id=1 corresponds to ablurrier scene.

In some embodiments, a subpel codebook such as that shown (in part) inTable 1 can be equivalently characterized as including a multiplicity ofmotion-compensation filters grouped into a plurality of subpel-positiongroups that respectively correspond to the plurality of subpelpositions, each of the plurality of subpel-position groups comprising aplurality of motion-compensation filters suitable for interpolatingblocks of a picture at a corresponding one of the plurality of subpelpositions. For example, the codebook shown in Table 1 can becharacterized as including 15 or 16 groups of motion-compensationfilters corresponding to subpel positions { a-o}, e.g.:

-   -   subpel position {a} group: {a₀, a₁, a₂ . . . a₁₅};    -   subpel position {b} group: {b₀, b₁, b₂ . . . b₁₅};        -   :    -   subpel position {o} group: {o₀, o₁, o₂ . . . o₁₅}.

The codebook may be further characterized as including several (e.g.,256) pre-determined subsets of motion-compensation filters, one fromeach subpel position group, e.g.:

-   -   subset id=0: {a₀, b₀, c₀, d₀, e₀, f₀, g₀, h₀, i₀, j₀, k₀, l₀,        m₀, n₀, o₀};    -   subset id=1: {a₁, b₁, c₁, d₁, e₁, f₁, g₁, h₁, i₁, j₁, k₁, l₁ m₁,        n₁, o₁};        -   :    -   subset id=15: {a₁₅, b₁₅, c₁₅, d₁₅, e₁₅, f₁₅, g₁₅, h₁₅, i₁₅, j₁₅,        k₁₅, l₁₅, m₁₅, n₁₅, o₁₅};    -   subset id=16: {a₀, b₅, c₇, d₉, e₄, f₄, g₁₂, h₆, i₇, j₂, k₄, l₁₁,        m₈, n₀, o₁₀};        -   :    -   subset id=255: {a₁₀, b₆, c₁₂, d₉, e₂, f₂, g₃, h₁₀, i₃, j₅, k₁,        l₈, m₁₁, n₆, o₁₀}.

In some embodiments, the codebook may further include a group ofinteger-position filters, e.g., integer-position group {0}: {0₀, 0₁, 0₂. . . 0₁₅}. In such embodiments, the pre-determined subsets ofmotion-compensation filters may also include an integer-position filter,e.g.: subset id=0: {0₀, a₀, b₀, c₀, d₀, e₀, f₀, g₀, h₀, i₀, j₀, k₀, l₀,m₀, n₀, o₀}; subset id=1: {0₁, a₁, b₁, c₁, d₁, e₁, f₁, g₁, h₁, i₁, j₁,k₁, l₁, m₁, n₁, o₁}; and so on.

In some embodiments, integer-position filters may be included in aninteger-position codebook. Table 2 shows two sample integer-positionfilters (id=0 and id=1) from an exemplary integer-position codebook. Inone embodiment, the integer-position codebook may include 48integer-position filters. In other embodiments, the integer-positioncodebook may include more or fewer filters. In some embodiments,integer-position filters may also be included within the subpel filtersets of the subpel filter codebook, instead of or in addition to theinteger-position codebook.

TABLE 2 Integer-Position Codebook subset Filter id = 0 O −58 162 48 51309 103 15 252 142 Filter id = 1 O −32 10 54 196 519 280 65 31 −99Filter id = 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . ..

FIG. 10 shows an ‘offline’ routine 1000 for generating a motion filtercodebook or codebooks for subpel and integer pel locations. In block1005, routine 1000 obtains a test set including one or more sample videosequences. In some embodiments, the video sequences are selected to havecombinations of different degrees of motion and a variety of nearlyuniform texture. In one embodiment, the test sequences are chosen suchthat they contain texture-like regions, which typically need moreprecise filtering in order to achieve the desired coding gain. In oneembodiment, a number of standard CIF sequences may be employed as samplevideo sequences.

Beginning in starting loop block 1010, routine 1000 processes each videosequence in the test set. Beginning in starting loop block 1015, routine1000 processes one or more individual pictures or frames of the currentvideo sequence. In block 1020, routine 1000 applies Wiener filter basedadaptive motion filtering to compute a fully adapted filter set thecurrent picture or frame. In some embodiments, to derive better filtersets, two or more iterations may be performed, meaning that thecomputation of filter coefficients and update of subpel locations may beiteratively performed two or more times (the first time subpelcollations are set to standard filter results, and in each subsequentiteration the positions are set to the ones obtained with the previouslycomputed filter set). In ¼ pel embodiments, a filter set thus generatedconsists of 16 filters since a filter is computed per each ¼ pellocation. In one embodiment, each individual filter in the generatedfilter set has either 6 or 9 taps depending on the ¼ pel location.

In ending loop block 1025, routine 1000 iterates back to block 1015 toprocess another individual picture or frame of the current videosequence (if any). In block 1030, routine 1000 selects a representativefilter set for the current video sequence from the generated filtersets. In one embodiment, selecting a representative filter set mayinclude applying all of the computed filter sets to each picture orframe of the video sequence and selecting a filter set that has a high(or the highest) coding gain (i.e., has a low SAD or the lowest SAD). Insome embodiments, the representative set may be selected according to asubset of pictures or frames of the current video sequence (e.g., thefirst N frames).

In ending loop block 1035, routine 1000 iterates back to block 1010 toprocess the next video sequence in the test set (if any). In oneembodiment, after all video sequences have been processed, up to 100 ormore representative filter sets may have been generated and selected. Inblock 1038, routine 1000 optionally refines the collection ofrepresentative filter sets. For example, in one embodiment, a randomwalk algorithm (or a similar optimization algorithm) may be employed totest random combinations of filters on some or all of the videosequences to further improve the overall coding gain provided by thecollection of refined filter sets over the course of hours or even days.

In block 1040, routine 1000 selects a “base” group of subpel filter setshaving high or the highest coding gain among the optionally refinedcollection of filter sets. In block 1045, routine 1000 stores theselected “base” group of filter sets in a subpel codebook.

In block 1050, routine 1000 derives a “virtual” codebook from theindividual filters from the selected “base” group of filter sets. In oneembodiment, a random walk algorithm (or a similar optimizationalgorithm) may be employed to test various combination of individualfilters from the selected “base” group of filter sets. In oneembodiment, 256 different combinations of filters may be derived fromthe selected “base” group of filter sets. The derived combinations arestored to create a “virtual” codebook that can be derived from filtersof the selected “base” group of filter sets.

In block 1055, a group of integer-position filters is selected fromamong the optionally refined collection of filter sets. In oneembodiment, the integer-position filters may be selected to have highcoding gain and to differ from one another. In one embodiment, 48integer-position filters may be selected for the group. In block 1060,the selected group of integer-position filters is stored in aninteger-position codebook. Having generated and stored a subpel codebookand an integer-position codebook, routine 1000 ends in block 1099.

FIG. 11 shows an ‘online’ routine 1100 for searching a codebook for amotion filter set in accordance with one embodiment. In block 1103,routine 1100 obtains a picture or frame of a video sequence. Beginningin opening loop block 1105, routine 1100 processes each block ofpicture-content of the picture.

In block 1108, routine 1100 determines an integer-position motionestimate for the current block of picture-content. In one embodiment, aninteger-position motion vector is computed by full or reduced searchusing a given motion search size. In block 1110, routine 1100 computes acoding gain (e.g., determines SAD) for the determined integer-positionmotion estimate.

In block 1113, routine 1100 determines a subpel motion estimate using adefault filter set (e.g., the H.264 fixed filter set, or any otherfilter set for use as a reference). Interpolated subpel locations aresearched to locate one with the highest coding gain (lowest SAD). Inother words, the default filter set is applied to the block ofpicture-content and the location that produces the smallest SAD ischosen. The location to which that filter set corresponds is used as theestimated subpel motion vector. In block 1115, routine 1100 saves (atleast temporarily) the overall coding gain for the default filter.

In block 1116, routine 1100 loads a “base” subpel codebook, including,e.g., 16 filter sets, each filter set including, e.g., 15subpel-position filters (one for each subpel position). Beginning inblock 1118, routine 1100 processes each filter set. In block 1120,routine 1100 computes a coding gain for the current filter set. Usingthe integer-position motion estimate as an offset, routine 1100determines a SAD for each subpel position using the correspondingsubpel-position filter from the current filter set. In ending loop block1023, routine 1100 iterates back to block 1118 to process the nextfilter set (if any).

In block 1023, routine 1100 assembles coding gains for N (e.g., 256)“virtual” filter sets using the computed coding gains for individualsubpel-position filters in each of the filter sets. In one embodiment,the “virtual” filter sets include various combinations of individualsubpel-position filters from the filter sets of the “base” subpelcodebook. Thus, coding gains for each “virtual” filter set can beassembled using the individual subpel-position filter coding gainsalready computed (in block 1120).

In block 1128, routine 1100 iterates back to block 1105 to process thenext block of picture-content (if any) of the picture.

In block 1133, routine 1100 sets a spatial partitioning mode. Dependingon the mode of operation, frame-based, slice-based, block-based,segment-based, or a like division of the picture may be used. Beginningin opening loop block 1135, routine 1100 processes each spatialpartition of the picture. In block 1138, routine 1100 selects from amongthe N “virtual” subpel filter sets a subpel filter set having a highcoding gain for the current partition. In one embodiment, the bestfilter set is chosen in respect to the smallest SAD/largest coding gain.In some embodiments, the lowest mode of operation uses a frame-baseddivision. The next two modes use slices. The lower slice mode divides aframe into four equal horizontal strips/slices (where the last slicecould be smaller in size depending on the frame size). On the otherhand, the higher slice mode uses 12×4 16×16 block slices (again theslices at the bottom and to the right border may be smaller due to framesize). The rest of the modes use the segments/regions which are derivedfrom merging blocks into groups of blocks where same filter set produceslow SAD. These regions in some sense correspond to motion partitions.There are two thresholds that are used in the process, and each mode hasdifferent selection of threshold values that can produce less or moresegments/regions. The frame is first split into blocks/supertiles. Thefirst threshold is used to determine how to split a 64×64 supertile into32×32 tiles, while the second one is used to determine when to merge thetile blocks across supertile boundaries. In both cases, the merging orsplitting decision is reached if the SAD difference of the twoblocks/objects in question is below or above the given threshold. Thesplitting of a supertiles into tiles is coded with 2×2 patterns.Different modes of operation support basic 3 or extensed 7 patterns. Thebasic 3 patterns are solid, horizontal split and vertical split, whileextended set also includes the four a-way splits. Then, the next stageof the process is to merge tiles that touch the supertile borders withneighbors if there is a common filter set that result in small enoughSAD (based on applying the second threshold). The merging bits are codedin the bitstream in addition to pattern variable-length codes (“VLCs”)so that decoder can completely recover the same spatial segments.

Having selected a subpel filter set having a high coding gain for thecurrent partition, in block 1140, routine 1100 encodes to a bitstream anindex or other code (e.g., subpelfilt_code) corresponding to theselected subpel filter set. In various embodiments, a fixed VLC table,an adaptive Huffman coding table, or the like can be used to code theindex or other code. If adaptive Huffman is used, the codes are, in oneembodiment, computed based on the frequencies of indices from theprevious frames, as it was observed in experiments that there exists atemporal redundancy, and same filter sets tend to appear in theneighboring frames.

In block 1141, routine 1100 loads an integer-position codebook includinga number (e.g., 48) integer-position filters. In decision block 1143,routine 1100 determines whether the integer motion estimate (determinedin block 1108) provides a higher coding gain (lower SAD) than theselected subpel filter set. If not, then routine 1100 proceeds to endingloop block 1153, where routine 1100 iterates back to block 1135 toprocess the next spatial partition (if any).

However, if the integer motion estimate (determined in block 1108)provides a higher coding gain (lower SAD) than the selected subpelfilter set, then in block 1145, routine 1100 selects from theinteger-position codebook an integer-position filter having a high (orthe highest) coding gain for the current spatial partition. In decisionblock 1148, routine 1100 determines whether the selectedinteger-position filter provides the highest coding gain (smallest SAD).If so, then in block 1150, routine 1100 encodes to the bitstream anindex or other code (e.g., intpelfilt_code) corresponding to theselected integer-position filter. In some embodiments, a flag or other1-bit header is also coded to the bitstream to specify that the selectedinteger-position filter from the integer-position codebook produces ahigher coding gain than the standard integer-position filter does

In ending loop block 1153, routine 1100 iterates back to block 1135 toprocess the next spatial partition (if any). Once all spatial partitionsare processed, routine 1100 ends in block 1199. In various embodiments,the method discussed can be applied per picture and one index to afilter set sent for an entire picture, a region or a segment, a group ofslices, for each quadtree or bi-tree partitions of a frame or a tile, ongroup blocks of a frame, on tiles, or fragments of a tile.

FIG. 12 illustrates an exemplary bitstream syntax 1200, in accordancewith various motion-compensation codebook filter encoders and decodersand variously described herein. Bitstream syntax 1200 begins with 3-bitheader mfc_hdr 1201. One-bit pict_only flag 1202 indicates whetherpicture based filtering will take place or not. If ‘yes,’ the followingoptional syntax element numpt 1203 is skipped; if ‘no,’ the 3-bit numptcode 1203 is sent. Optional 3-bit numpt field 1203 indicates a number ofpartitions (up to eight).

Optional 1-bit map_sent flag 1204 indicates whether a partition map issent to indicate where the filter is applied or not, or alternatively,to switch between multiple filters. Optional n-bit ptmap field 1205includes the partition map (if any).

One-bit filt_sent flag 1206 indicates whether a subpel filter code isincluded in the bitstream. If flag 1206 is set, then 8-bitsubpelfilt_code 1208 is sent to identify the subpel filter set to beused; otherwise, subpelfilt_code 1208 is not sent.

Flag intfilt_sent 1210 indicates whether an integer-position filter codeis included in the bitstream. When set to ‘1,’ intfilt_sent 1210indicates that 6-bit intpelfilt_code 1211 is sent to identify theinteger-position filter to be used. Otherwise, intpelfilt_code 1211 isnot sent.

The sequence of codes filt_sent 1206, subpelfilt_code 1208, intfilt_sent1210, and intpelfilt_code 1211 occurs once only if there if only 1partition (picture only) mode is used; else, the sequence is repeatednumpt 1203 times.

FIG. 13 a illustrates a sequence of pictures or frames 1301-1308 withina video stream, including I-frames 1301, 1308 (independently codedpictures); P-frames 1304, 1306 (unidirectionally predicted codedpictures); and B-frames 1302-1303, 1305, 1307 (bi-directionallypredicted coded pictures), as is typical in video coding as per any ofthe MPEG standards. The illustrated picture structure also showsvariable number of B-frames, although that fact in itself is not a keyto our motion filtering discussion. More pertinently, while I-picture1301, 1308 does not need motion filter set info, P-picture 1304, 1306needs one or more filter sets, while B-pictures 1302-1303, 1305, 1307need two (due to bidirectional references) or more filter sets.

Error! Reference source not found. indicates an exemplary coding bitcost for encoding Motion-Compensation Codebook Filters according tovarious combinations of picture type and number of partitions (numpt),in accordance with various embodiments, including motion filtering modes(e.g. ‘subpel’, and ‘int and subpel’), for P- and B-picture types. Toreduce bit cost for B-pictures, 2 additional modes (e.g. ‘picturesubpel’, and ‘picture int subpel’) are introduced. Overall, it can beseen that for P-pictures, signaling subpel filter set only takes between13 and 43 bits (for up to 4 partitions), an signaling both int andsubpel filters set only takes between 19 and 67 bits, and B-pictures forsubpel between 22 and 79 bits, and B-pictures for int and subpel between34 and 127 bits. (The exemplary coding bit costs shown in Error!Reference source not found. exclude bit costs for spatial partition mapssuch as regions, slices, tiles or tile fragments, picture bi-tree orquad-tree, tile bi-tree or quad-tree, and/or merged blocks.)

TABLE 3 Number of Filter Sets and Coding bits cost numpt = 1 numpt = 2numpt = 3 numpt = 4 Picture Type Num Approx Num Approx Num Approx NumApprox (and motion filter Filt. Bits Filt. Bits Filt. Bits Filt. Bitsmodes) Sets cost* Sets cost* Sets cost* Sets cost* I — — — — — — — — P:subpel 1 13 2 25 3 34 4 43 P: int and subpel 1 19 2 37 3 52 4 67 B:picture, subpel 2 22 2 22 2 22 2 22 B: picture, int and 2 34 2 34 2 34 234 subpel B: subpel 2 22 4 43 6 61 8 79 B: int and subpel 2 34 4 67 6 978 127

FIG. 13 b illustrates a sequence of pictures or frames 1301-1308 withina video stream, including I-frames 1301, 1308, which are partitionedinto three exemplary partitions (numpt=3); P-frames 1304, 1306, whichare partitioned into three exemplary partitions (numpt=3); and B-frames1302-1303, 1305, 1307, which are partitioned into two exemplarypartitions (numpt=2). As illustrated in FIG. 13 b, the partitions formotion filtering can be fully adaptive and on a picture basis canoperate in any of the modes (picture, regions, slices, tiles, mergedfragments of a tile, picture bi-tree or tile merged bi-tree, picturequadtree or tile merged quadtree, merged blocks, or the like). Forinstance, FIG. 13 b shows that the first P-picture 1304 consists of 3slices, while the second B-picture 1303 is bi-tree coded and consists of2 partitions. Further, the second P-picture 1306 is partitioned into a3×3 array of large tiles while the third B-frame 1305 is coded with abi-tree split. Following examples of FIG. 13 b, for the case of codebookmotion filtering, motion filter bit counts for each picture in the shownpicture structure, can be computed.

FIG. 14 illustrates an exemplary video encoding/decoding system 1400according to one embodiment, the system 1400 including anunencoded-video source 1415, an encoding device 1500 (see FIG. 15,discussed below), decoding device 1600 (see FIG. 16, discussed below)with an optional external display 1425, and an optional encoded-videosource 1420. In some embodiments, one or both of encoding device 1500and/or decoding device 1600 may be connected to a network 1450. In someembodiments, decoding device 1600 and encoding device 1500 may comprisea single device. In some embodiments, more than one encoding device 1500may be present; for example, one encoding device may perform “offline”codebook-generating processes, while another encoding device may perform“online” encoding processes, as discussed throughout this disclosure.

In some embodiments, other servers and/or devices (not shown) may alsobe present. For example, in some embodiments, a distribution server (notshown) may distribute encoded video to decoding device 1600 via network1450.

In some embodiments, encoding device 1500 may communicate withunencoded-video source 1415 via network 1450, a storage area network(“SAN”), a high speed serial bus, and/or via other suitablecommunication technology. Similarly, in some embodiments, decodingdevice 1600 may communicate with encoded-video source 1420 via network1450, a storage area network (“SAN”), a high speed serial bus, and/orvia other suitable communication technology. In some embodiments,encoding device 1500, decoding device 1600, encoded-video source 1420,and/or unencoded-video source 1415 may comprise one or more replicatedand/or distributed physical or logical devices.

In various embodiments, network 1450 may include the Internet, a localarea network (“LAN”), a wide area network (“WAN”), a cellular datanetwork, and/or other data network. In many embodiments, there may bemore encoding devices 1500, decoding devices 1600, encoded-video sources1420, and/or unencoded-video sources 1415 than are illustrated.

FIG. 15 illustrates several components of an exemplary encoding device1500, in accordance with one embodiment. FIG. 15 illustrates severalcomponents of an exemplary encoding device 1500. In some embodiments,encoding device 1500 may include many more components than those shownin FIG. 15. However, it is not necessary that all of these generallyconventional components be shown in order to disclose an illustrativeembodiment. As shown in FIG. 15, encoding device 1500 includes anoptional network interface 1530 for optionally connecting to the network1450.

The Encoding device 1500 also includes at least one processing unit 1510(e.g., a general purpose central processing unit, an embedded processingunit, a special-purpose video processing unit, or the like), a memory1550, an optional output device and/or display 1540, and an optionalinput device 1570 (e.g., a keyboard, mouse, remote, joy stick, and thelike), all interconnected along with the optional network interface 1530via a bus 1520. The memory 1550 generally comprises a random accessmemory (“RAM”), a read only memory (“ROM”), and a permanent mass storagedevice, such as a disk drive. The memory 1550 stores a video encoderwith codebook motion-compensation filtering 800 (see FIG. 8, discussedabove); one or both of a motion-compensation subpel filter set codebook1565 and a motion-compensation integer-position filter codebook 1570; anoptional “offline” codebook generating routine 1000 (see FIG. 10,discussed above); a motion-compensation filter codebook search routine1100 (see FIG. 11, discussed above); and a codebook motion-compensationfiltering video encoding routine (see FIG. 17, discussed below). Inaddition, the memory 1550 also stores an operating system 1555. In someembodiments, these software components may be loaded from a computerreadable storage medium 1595 into memory 1550 of the encoding device1500 using a drive mechanism (not shown) associated with a non-transientcomputer readable storage medium 1595, such as a floppy disc, tape,DVD/CD-ROM drive, memory card, or the like. In some embodiments,software components may also be loaded via the optional networkinterface 1530, rather than via a computer readable storage medium 1595.

In some embodiments, encoding device 1500 may further comprise aspecialized interface 1535 for communicating with unencoded-video source1415, such as a high speed serial bus, or the like. In some embodiments,encoding device 1500 may communicate with unencoded-video source 1415via network interface 1530. In other embodiments, unencoded-video source1415 may reside in memory 1550.

Although an exemplary encoding device 1500 has been described thatgenerally conforms to conventional general purpose computing devices, anencoding device 1500 may be any of a great number of devices capable ofencoding video, for example, a video recording device, a videoco-processor and/or accelerator, a personal computer, a game console, aset-top box, a handheld computer, a cell phone, or any other suitabledevice.

FIG. 16 illustrates several components of an exemplary decoding device1600, in accordance with one embodiment. In some embodiments, decodingdevice 1600 may include many more components than those shown in FIG.16. However, it is not necessary that all of these generallyconventional components be shown in order to disclose an illustrativeembodiment. As shown in FIG. 16, decoding device 1600 includes anoptional network interface 1630 for optionally connecting to the network1450.

The Decoding device 1600 also includes at least one processing unit 1610(e.g., a general purpose central processing unit, an embedded processingunit, a special-purpose video processing unit, or the like), a memory1650, an optional output device and/or display 1640, and an optionalinput device 1670 (e.g., a keyboard, mouse, remote, joy stick, and thelike), all interconnected along with the optional network interface 1630via a bus 1620. The memory 1650 generally comprises a random accessmemory (“RAM”), a read only memory (“ROM”), and a permanent mass storagedevice, such as a disk drive. The memory 1650 stores program code for avideo decoder 900 with codebook Motion-compensation filtering (see FIG.9, discussed above); one or both of a motion-compensation subpel filterset codebook 1665 and a motion-compensation integer-position filtercodebook 1670; and a codebook motion-compensation filtering videodecoding routine (see FIG. 21, discussed below). In addition, the memory1650 also stores an operating system 1655. In some embodiments, thesesoftware components may be loaded from a computer readable storagemedium 1695 into memory 1650 of the Decoding device 1600 using a drivemechanism (not shown) associated with a non-transient computer readablestorage medium 1695, such as a floppy disc, tape, DVD/CD-ROM drive,memory card, or the like. In some embodiments, software components mayalso be loaded via the optional network interface 1630, rather than viaa computer readable storage medium 1695.

In some embodiments, decoding device 1600 may further comprise aspecialized interface 1635 for communicating with encoded-video source1420, such as a high speed serial bus, or the like. In some embodiments,decoding device 1600 may communicate with encoded-video source 1420 vianetwork interface 1630. In other embodiments, encoded-video source 1415may reside in memory 1650.

Although an exemplary Decoding device 1600 has been described thatgenerally conforms to conventional general purpose computing devices, andecoding device 1600 may be any of a great number of devices capable ofdecoding video, for example, a video-play device, a personal computer, agame console, a set-top box, a handheld computer, a cell phone, or anyother suitable device.

FIG. 17 illustrates a codebook motion-compensation filtering videoencoding routine 1700, such as may be performed by encoding device 1500in accordance with one embodiment. In subroutine block 1800 (see FIG.18, discussed below), routine 1700 obtains a codebook including amultiplicity of motion-compensation filters grouped into a plurality ofsubpel-position groups that respectively correspond to a plurality ofsubpel positions, each of the plurality of subpel-position groupscomprising a plurality of motion-compensation filters suitable forinterpolating blocks of a picture at a corresponding one of theplurality of subpel positions. For example, as discussed above inreference to Table 1, a codebook may include a multiplicity ofmotion-compensation filters (e.g., a_(0 . . . 15), b_(0 . . . 15) . . .o_(0 . . . 15)) grouped into subpel-position groups, such as thefollowing:

-   -   subpel position {a} group: {a₀, a₁, a_(2 . . . 15)};    -   subpel position {b} group: {b₀, b₁, b_(2 . . . 15)};        -   :    -   subpel position {o} group: {o₀, o₁, o_(2 . . . 15)}.

In block 1705, routine 1700 obtains an unencoded frame or picture ofvideo for encoding. In some cases, the unencoded frame or picture ofvideo may be determined to include a number of different portions (see,e.g., FIGS. 7 a-f, showing various partitioning modes for dividing apicture into portions). In other cases, the entire unencoded frame orpicture of video may be treated as a single portion.

During encoding of the unencoded frame or picture, routine 1700processes each of the one or more portions of the unencoded frame orpicture beginning in starting loop block 1710. In subroutine block 1900(see FIG. 19, discussed below), routine 1700 selects a subset of themultiplicity of motion-compensation filters from the codebook as beingwell-adapted for the current portion of the video frame or picture, theselected subset including one from each of the plurality ofsubpel-position groups. For example, as discussed above in reference toTable 1, a codebook may be further characterized as including a number(e.g., 256) of pre-determined subsets of motion-compensation filters,one from each subpel position group, e.g.

-   -   subset id=0: {a₀, b₀, c₀, d₀, e₀, f₀, g₀, h₀, i₀, j₀, k₀, l₀,        m₀, n₀, o₀};    -   subset id=1: {a₁, b₁, c₁, d₁, e₁, f₁, g₁, h₁, i₁, j₁, k₁, l₁,        m₁, h₁, o₁};        -   :    -   subset id=15: {a₁₅, b₁₅, c₁₅, d₁₅, e₁₅, f₁₅, g₁₅, h₁₅, i₁₅, j₁₅,        k₁₅, l₁₅, m₁₅, n₁₅, o₁₅};    -   subset id=16: {a₀, b₅, c₇, d₉, e₄, f₄, g₁₂, h₆, i₇, j₂, k₄, l₁₁,        m₈, n₀, o₁₀};        -   :    -   subset id=255: {a₁₀, b₆, c₁₂, d₉, e₂, f₂, g₃, h₁₀, i₃, j₅, k₁,        l₈, m₁₁, n₆, o₁₀}.

Subroutine block 1900 returns a filterset_sent flag and (if thefilterset_sent flag==1) a subpel-filter set code identifying theselected subset of the plurality of motion-compensation filters withinthe codebook. For example, in one embodiment, the subpel-filter set codemay be (or be derived from) a “subset id” number or other index into thecodebook. In block 1720, routine 1700 writes the returned filterset_sentflag and subpel-filter set code (if indicated by filterset_sent flag) toan encoded bitstream being generated by routine 1700.

In subroutine block 2000, routine 1700 optionally determines aninteger-position motion-compensation filter (see FIG. 20 discussedbelow) for the current portion of the unencoded frame or picture. Inending loop block 1730, routine 1700 iterates back to block 1710 toprocess the next portion of the unencoded frame or picture (if any).Having thus encoded at least a motion-compensation filter set to thebitstream, routine 1700 ends in block 1799. In many cases, routine 1700may be performed serially for a number of frames of a video, routine1700 being part of a larger video-encoding process.

FIG. 18 illustrates a subroutine 1800 for obtaining a codebook, inaccordance with one embodiment. In some embodiments, the process ofgenerating a codebook may be quite lengthy (taking hours or even days),so the codebook may be generated only once (or at least infrequently)and stored for re-use. In decision block 1805, subroutine 1800determines whether a previously-generated codebook has been stored forre-use. If so, then in block 1810, subroutine 1800 reads the storedcodebook and returns it in ending block 1899.

However, if a previously-generated codebook has not been stored forre-use, then subroutine 1800 begins the process of generating acodebook. In some embodiments, blocks 1815-1865 may be performedindependently, as an “offline” codebook-generating routine. Blocks1815-1865 can be understood as an alternate view or alternatecharacterization similar to the processes shown in blocks 1005-1050 ofFIG. 10, which is discussed above at length. For the sake of brevity,the subject matter discussed above in relation to FIG. 10 will generallynot be reiterated in the discussion, below, of FIG. 18.

Beginning in starting loop block 1815, subroutine 1800 processes each ofa number of subpel positions (e.g., a-o, as illustrated in FIG. 3,discussed above).

In block 1820, subroutine 1800 determines a default motion-compensationfilter for the current subpel position. For example, in one embodiment,subroutine 1800 may use a fixed subpel motion-compensation filter, suchas from the H.264 fixed filter set or any other suitable default set offilters.

In block 1825, subroutine 1800 iteratively refines the determineddefault motion-compensation filter to generate a multiplicity of refinedmotion-compensation filters for the current subpel position. Forexample, in one embodiment, subroutine 1800 may employ a random walkalgorithm (or a similar optimization algorithm) to iteratively refinethe determined default motion-compensation filter to generate amultiplicity of refined motion-compensation filters.

Beginning in starting loop block 1830, subroutine 1800 processes each ofthe refined multiplicity of refined motion-compensation filters. Inblock 1835, subroutine 1800 determines a coding gain (e.g., a measure ofSAD) for the current refined motion-compensation filter. In block 1840,subroutine 1800 iterates back to block 1830 to process the next refinedmotion-compensation filter (if any).

In block 1845, subroutine 1800 uses the determined coding gains toselect a group of good-performing refined motion-compensation filtersfor the current subpel position (e.g., a group of filters with highcoding gain/low SAD). In block 1850, subroutine 1800 stores the selectedgroup of good-performing refined motion-compensation filters for thecurrent subpel position. In ending loop block 1855, subroutine 1800iterates back to block 1815 to process the next subpel position (ifany). In some embodiments, the selected group of good-performing refinedmotion-compensation filters may be considered as “base” filters (asdiscussed above) for the current subpel position, which together with“base” filters for other subpel positions, form a “base” codebook or“base” group of filter sets.

In block 1860, subroutine 1800 uses the groups of good-performingrefined motion-compensation filters (one group for each subpel position)to iteratively determine a plurality of filter sets, each filter setincluding a distinct combination of filters, one filter for each subpelposition. (In some contexts in this disclosure, “filter sets” are alsoreferred to as “subsets” of motion compensation filters, e.g., {a₀, b₅,c₇, d₉, e₄, f₄, g₁₂, h₆, i₇, j₂, k₄, l₁₁, m₈, n₀, o₁₀}.) In someembodiments, subroutine 1800 may iteratively determine the plurality offilter sets/subsets using a random walk algorithm (or a similaroptimization algorithm). In block 1865, subroutine 1800 indicates thedetermined filter sets/subsets in the codebook, such that each of thedetermined filter sets/subsets can be addressed, selected, indexed, orotherwise identified within the codebook. For example, in oneembodiment, subroutine 1800 may assign each of the determined filtersets/subsets an “id” number or index.

In block 1870, subroutine 1800 stores the codebook thus generated forsubsequent re-use. In block 1899, subroutine 1800 ends, returning thecodebook.

FIG. 19 illustrates a subroutine 1900 for selecting a subset ofmotion-compensation filters from the codebook, in accordance with oneembodiment. FIG. 19 can be understood as an alternate view or alternatecharacterization similar to the processes shown in FIG. 11, which isdiscussed above at length. For the sake of brevity, the subject matterdiscussed above in relation to FIG. 11 will generally not be reiteratedin the discussion, below, of FIG. 19.

In block 1903, subroutine 1900 obtains at least a portion of a picture(see, e.g., FIGS. 7 a-f, showing various partitioning modes for dividinga picture into portions), the portion of a picture including a number ofblocks of picture content. Beginning in starting loop block 1905,subroutine 1900 processes each block of picture content of thepicture-portion. Beginning in starting loop block 1908, subroutine 1900processes each of a number of subpel positions (e.g., a-o, asillustrated in FIG. 3, discussed above).

In block 1910, subroutine 1900 obtains a multiplicity of “base”motion-compensation filters for the current subpel position (e.g., a₀,a₁, a₂ . . . a₁₅). Beginning in starting loop block 1913, subroutine1900 processes each of the “base” motion-compensation filters for thecurrent subpel position. In block 1915, subroutine 1900 determines anindividual coding gain (e.g., by computing a SAD) for the current “base”motion-compensation filter for the current subpel position (e.g., a₀).In ending loop block 1918, subroutine 1900 iterates back to block 1913to process the next “base” motion-compensation filter (if any) for thecurrent subpel position.

Having determined coding gains for each of the “base”motion-compensation filters for the current subpel position, in block1920, subroutine 1900 determined a coding gain for a “default”motion-compensation filter, which is part of a defaultmotion-compensation filter set. For example, in one embodiment,subroutine 1900 may determine a coding gain for a fixedmotion-compensation filter for the current subpel position, such as oneof the filters from the set of fixed motion-compensation filter used inH.264 or other suitable set of “default” motion-compensation filter.

In ending loop block 1923, subroutine 1900 iterates back to block 1908to process the next subpel position (if any). In ending loop block 1925,subroutine 1900 iterates back to block 1905 to process the next block ofpicture content of the picture-portion (if any).

In block 1928, subroutine 1900 obtains a plurality of adaptive filtersets, each filter set comprising one of the “base” motion-compensationfilters for each subpel position. For example, in one embodiment,subroutine 1900 may obtain a codebook including a plurality of adaptivefilter sets such as the following:

-   -   set id=0: {a₀, b₀, c₀, d₀, e₀, f₀, g₀, h₀, i₀, j₀, k₀, l₀, m₀,        n₀, o₀};    -   set id=1: {a₁, b₁, c₁, d₁, e₁, f₁, g₁, h₁, i₁, j₁, k₁, l₁, m₁,        n₁, o₁};        -   :    -   set id=15: {a₁₅, b₁₅, c₁₅, d₁₅, e₁₅, f₁₅, g₁₅, h₁₅, i₁₅, j₁₅,        k₁₅, l₁₅, m₁₅, n₁₅, o₁₅};    -   set id=16: {a₀, b₅, c₇, d₉, e₄, f₄, g₁₂, h₆, i₇, j₂, k₄, l₁₁,        m₈, n₀, o₁₀};        -   :    -   set id=255: {a₁₀, b₆, c₁₂, d₉, e₂, f₂, g₃, h₁₀, i₃, j₅, k₁, l₈,        m₁₁, n₆, o₁₀}.

Beginning in starting loop block 1930, subroutine 1900 processes each ofthe obtained adaptive filter sets. In block 1933, subroutine 1900determines an aggregate coding gain for the current adaptive filter set.For example, in one embodiment, determining an aggregate coding gain mayinclude summing individual coding gains (as determined in block 1915)for the constituent filters of the current adaptive filter set. Inending loop block 1935, subroutine 1900 iterates back to block 1930 toprocess the next adaptive filter set (if any).

Having determined aggregate coding gains for each of the each of theadaptive filter sets, in block 1938, subroutine 1900 determines a“default” aggregate coding gain for the “default” filter set (e.g., theset of fixed filters from H.264 or other suitable set), using theindividual “default” coding gains determined in block 1920, discussedabove.

In block 1940, using the aggregate coding gains determined in block1933, subroutine 1900 selects an adaptive filter set with a favorableaggregate coding gain for the portion of a picture obtained in block1903. In some embodiments, the selected adaptive filter set may be theadaptive filter set with the highest determined aggregate coding gain.

In decision block 1943, subroutine 1900 compares the “default” aggregatecoding gain determined in block 1938 with the aggregate coding gain ofthe selected favorable adaptive filter set. If the “default” filter setprovides higher coding gain (lower SAD), then in block 1950, subroutine1900 sets a filterset_sent flag to ‘0’ or ‘NO,’ and returns thefilterset_sent flag in ending block 1999.

However, if the adaptive filter set provides higher coding gain (lowerSAD), then in block 1945, subroutine 1900 sets a filterset_sent flag to‘1’ or ‘YES,’ and in block 1948, subroutine 1900 determines asubpel-filter set code identifying the selected adaptive filter set. Forexample, in one embodiment, the subpel-filter set code may be (or bederived from) a “subset id” number or other index into a codebook.Subroutine 1900 returns the filterset_sent flag and the determinedsubpel-filter set code in ending block 1999.

FIG. 20 illustrates a subroutine 2000 for determining aninteger-position motion-compensation filter for a portion of a picture,in accordance with one embodiment. In block 2005, subroutine 2000obtains at least a portion of a picture (see, e.g., FIGS. 7 a-f, showingvarious partitioning modes for dividing a picture into portions), theportion of a picture including a number of blocks of picture content.Beginning in starting loop block 2010, subroutine 2000 processes eachblock of picture content of the picture-portion.

In block 2015, subroutine 2000 obtains a plurality of integer-positionmotion-compensation filters, e.g., 0₀, 0₁, 0₂ . . . 0₄₇. For example, inone embodiment, subroutine 2000 may obtain an integer-position codebook,such as that partially shown in Table 2, above. In other embodiments,the plurality of integer-position motion-compensation filters may beincluded within a codebook that also includes subpel-position filters.

Beginning in starting loop block 2020, subroutine 2000 processes each ofthe plurality of integer-position motion-compensation filters. In block2025, subroutine 2000 determines an individual coding gain (e.g., bycomputing a SAD) for the current integer-position motion-compensationfilter. In ending loop block 2030, subroutine 2000 iterates back toblock 2020 to process the next integer-position motion-compensationfilter (if any). In ending loop block 2035, subroutine 2000 iteratesback to block 2010 to process the next block of picture content (if any)of the picture-portion.

Once coding gains have been determined for each integer-positionmotion-compensation filter and each block of picture content of thepicture-portion, in block 2040, subroutine 2000 selects one of theplurality of integer-position motion-compensation filters as having afavorable coding gain (low SAD) for the current picture-portion.

In decision block 2045, subroutine 2000 compares the coding gain of theselected favorable integer-position motion-compensation filter with acoding gain of a subpel filter set also selected for the samepicture-portion (see, e.g., discussion of block 2040 in FIG. 20, above).If the subpel filter set provides higher coding gain (lower SAD), thenin block 2060, subroutine 2000 sets an intfilt_sent flag in thebitstream to ‘0’ or ‘NO,’ and returns in ending block 2099.

However, if the favorable integer-position motion-compensation filterprovides higher coding gain (lower SAD), then in block 2050, subroutine2000 sets an intfilt_sent flag to ‘1’ or ‘YES,’ and in block 2055,subroutine 2000 writes to the bitstream an integer-position-filter codeidentifying the selected favorable integer-position motion-compensationfilter. For example, in one embodiment, the integer-position-filter codemay be (or be derived from) a “id” number or other index into acodebook. Subroutine 2000 returns in ending block 2099.

FIG. 21 illustrates a codebook motion-compensation filtering videodecoding routine 2100, such as may be performed by decoding device 1600in accordance with one embodiment. In block 2105, routine 2100 obtainsan encoded bitstream from an encoded-video source, the encoded bitstreamincluding one or more pictures or frames of video. Beginning in startingloop block 2110, routine 2100 processes each of the encoded pictures orframes of video.

In block 2115, routine 2100 reads from the bitstream one or morepicture-portion codes identifying one or more picture-portions (see,e.g., FIGS. 7 a-f, showing various partitioning modes for dividing apicture into portions) of the current encoded picture or frame. Forexample, in one embodiment, routine 2100 may read some or all of codessuch as pict_only 1202, numpt 1203, map_sent 1204, and/or ptmap 1205, asshown in FIG. 12 and discussed above.

Beginning in starting loop block 2120, routine 2100 processes each ofthe one or more picture-portions of the current encoded picture or frameof video.

In decision block 2125, routine 2100 determines whether the encodedbitstream includes an integer-position filter code for the currentpicture-portion of the current encoded picture or frame of video. Forexample, in one embodiment, routine 2100 may determine whether theencoded bitstream includes an intfilt_sent flag 1210, as shown in FIG.12 and discussed above.

If routine 2100 determines that the encoded bitstream includes such aninteger-position filter code, then in block 2130, routine 2100 reads aninteger-position filter code from the bitstream. For example, in oneembodiment, routine 2100 may read an intpelfilt_code 1211 code from thebitstream, as shown in FIG. 12 and discussed above.

In block 2135, routine 2100 obtains a plurality of integer-positionmotion-compensation filters, e.g., 0₀, 0₁, 0₂ . . . 0₄₇. For example, inone embodiment, subroutine 2000 may obtain an integer-position codebook,such as that partially shown in Table 2, above. In other embodiments,the plurality of integer-position motion-compensation filters may beincluded within a codebook that also includes subpel-position filters.Typically, routine 2100 would read a previously-stored copy of theplurality of integer-position motion-compensation filters from a memoryaccessible to routine 2100.

In block 2140, routine 2100 selects one of the plurality ofinteger-position motion-compensation filters as indicated by theinteger-position filter code (e.g. intpelfilt_code 1211) read from thebitstream in block 2130. Subroutine 2100 then uses the selectedinteger-position motion-compensation filter in block 2170 to predictblocks of the current picture-portion of the current encoded picture orframe of video.

However, if in decision block 2125, routine 2100 determines that theencoded bitstream does not include an integer-position filter code, thenin decision block 2145, routine 2100 determines whether the encodedbitstream includes an subpel filter set code for the currentpicture-portion of the current encoded picture or frame of video. Forexample, in one embodiment, routine 2100 may determine whether theencoded bitstream includes an filt_sent flag 1206, as shown in FIG. 12and discussed above. If not, then in block 2165, routine 2100 selected adefault subpel motion-compensation filter set (e.g., the set of fixedsubpel filters used in H.264, or other suitable set of default filters).Subroutine 2100 then uses the default subpel motion-compensation filterset in block 2170 to predict blocks of the current picture-portion ofthe current encoded picture or frame of video.

If, however, routine 2100 determines in decision block 2145 that theencoded bitstream includes an subpel filter set code for the currentpicture-portion of the current encoded picture or frame of video, thenin block 2150, routine 2100 reads an subpel filter set code from thebitstream. For example, in one embodiment, routine 2100 may read ansubpelfilt_code 1208 code from the bitstream, as shown in FIG. 12 anddiscussed above.

In block 2155, routine 2100 obtains a subpel motion-compensationcodebook, such as that partially shown in Table 1, discussed above.Typically, routine 2100 would read a previously-stored copy of thesubpel motion-compensation codebook from a memory accessible to routine2100.

In block 2140, routine 2100 selects one of the plurality of subpelmotion-compensation filter sets as indicated by the subpel filter setcode (e.g. subpelfilt_code 1208) read from the bitstream in block 2150.Subroutine 2100 then uses the selected subpel motion-compensation filterset in block 2170 to predict blocks of the current picture-portion ofthe current encoded picture or frame of video.

In ending loop block 2175, routine 2100 iterates back to block 2120 toprocess the next picture-portion (if any) of the current encoded pictureor frame of video.

In block 2180, routine 2100 generates a decoded picture according to thepredicted blocks of the one or more picture portions predicted invarious iterations of block 2170. In block 2185, routine 2100 rendersthe generated picture to a display associated with the device performingroutine 2100.

In ending loop block 2190, routine 2100 iterates back to block 2110 toprocess the next encoded picture or frame of video (if any). Routine2100 ends in block 2199.

Although specific embodiments have been illustrated and describedherein, it will be appreciated by those of ordinary skill in the artthat alternate and/or equivalent implementations may be substituted forthe specific embodiments shown and described without departing from thescope of the present disclosure. This application is intended to coverany adaptations or variations of the embodiments discussed herein.

1.-23. (canceled)
 24. A video-decoder-device-implemented method forpredicting blocks of an encoded video frame, the method comprising:obtaining, by the video decoder device, a codebook comprising amultiplicity of motion-compensation filters grouped into a plurality ofsubpel-position groups that respectively correspond to a plurality ofsubpel positions, each of the plurality of subpel-position groupscomprising a plurality of motion-compensation filters suitable forinterpolating blocks of the encoded video frame at a corresponding oneof the plurality of subpel positions; obtaining an encoded bitstreamcomprising the encoded video frame and a subpel-filter code identifyingan adaptive motion-compensation filter set within the codebook, theadaptive motion-compensation filter set comprising the plurality ofmotion-compensation filters respectively corresponding to the pluralityof subpel positions; during decoding of the encoded video frame, thevideo decoder device selecting from the codebook the adaptivemotion-compensation filter set identified by the subpel-filter code;using the adaptive motion-compensation filter set identified by thesubpel-filter code, predicting a plurality of blocks of the encodedvideo frame; generating a decoded picture according to at least thepredicted plurality of blocks of the encoded video frame; and renderingthe generated decoded picture to a display associated with the videodecoder device.
 25. The method of claim 24, wherein the encodedbitstream further comprises: a second subpel-filter code, identifying asecond adaptive motion-compensation filter set within the codebook; andat least one portion-identification code enabling the video decoder toidentify a first portion of the encoded video frame and a second portionof the encoded video frame.
 26. The method of claim 25, furthercomprising: during decoding of the encoded video frame, the videodecoder device selecting from the codebook the second adaptivemotion-compensation filter set identified by the second subpel-filtercode; using the second adaptive motion-compensation filter set,predicting a second plurality of blocks of the encoded video framecorresponding to at least the second portion of the encoded video frame;and wherein the decoded picture is generated further according to thepredicted second plurality of blocks of the encoded video frame.
 27. Themethod of claim 24, further comprising obtaining a plurality ofinteger-position motion-compensation filters.
 28. The method of claim27, wherein the encoded bitstream further comprises: at least oneportion-identification code enabling the video decoder device toidentify a first portion of the encoded video frame and a second portionof the encoded video frame; and an integer-filter code identifying oneof the plurality of integer-position motion-compensation filters; and aninteger-filter flag indicating that the integer-filter code is includedin the bitstream for at least the second portion of the encoded videoframe.
 29. The method of claim 28, further comprising, during decodingof the encoded video frame: reading the integer-filter flag andresponsively selecting from the plurality of integer-positionmotion-compensation filters an integer-position motion-compensationfilter identified by the integer-filter code; using the selectedinteger-position motion-compensation filter, predicting the secondportion of the encoded video frame; and wherein the decoded picture isgenerated further according to the predicted second portion of theencoded video frame.
 30. The method of claim 27, wherein the codebookfurther comprises the plurality of integer-position motion-compensationfilters.
 31. The method of claim 27, wherein obtaining the plurality ofinteger-position motion-compensation filters comprises obtaining aninteger-position codebook.
 32. A non-transitory computer-readablestorage medium storing instructions that, when executed by a processor,perform the method of claim
 24. 33. A video-encoding apparatuscomprising a processor and a storage medium storing instructions that,when executed by the processor, perform the method of claim 24.